Constraint Relaxation to Reduce Brittleness of Distributed Agent Protocols
نویسندگان
چکیده
Incompatible goals among multiple agents working on domains involving finite constraints can be a source of conflict. This conflict, in the form of incompatible constraints established locally by the agents and imposed on the negotiated variables, may break the dialogue between these agents even though they could, in principle, reach an agreement. A common means of coordinating multi-agent systems is by using protocols to which are attached constraints on interaction; but protocols are brittle, in the sense that the constraints they contain must either succeed or fail, and if they fail the entire protocol may fail. We apply a constraint relaxation technique originally for automated negotiation using a distributed protocol language called the Lightweight Coordination Calculus (LCC), in order to overcome a class of conflicts, making protocols less brittle. This approach is illustrated in a scenario involving the ordering and configuration of a computer between the customer and vendor agents.
منابع مشابه
A multi-factor concept on guiding constraint relaxation in Distributed Constraint Satisfaction
Over-constrained can usually be encountered when some real-life applications are described as Distributed Constraint Satisfaction (DisCSP). When a solution is required in this case, one or more constraints should be released. This paper focuses on the constraint relaxation for handling such an over-constrained situation. Three types of influence factor, variable influence factor, constraint inf...
متن کاملSDO relaxation approach to fractional quadratic minimization with one quadratic constraint
In this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. First we introduce a parametric equivalent of the problem. Then a bisection and a generalized Newton-based method algorithms are presented to solve it. In order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...
متن کاملDistributed Contingency Logic and Security
In information security, ignorance is not bliss. It is always stated that hiding the protocols (let the other be ignorant about it) does not increase the security of organizations. However, there are cases that ignorance creates protocols. In this paper, we propose distributed contingency logic, a proper extension of contingency (ignorance) logic. Intuitively, a formula is distributed contingen...
متن کاملAddressing Constraint Failures in Agent Interaction Protocol
The field of multi-agent systems shifts attention from one particular agent to a society of agents; hence the interactions between agents in the society become critical towards the achievement of their goals. We assume that the interactions are managed via an agent protocol which enables agents to coordinate their actions in order to handle the dependencies that exist between their activities. ...
متن کامل